Power Allocation and Task Scheduling on Multiprocessor Computers with Energy and Time Constraints
نویسنده
چکیده
Performance-driven computer development has lasted for over six decades. Computers have been developed to achieve higher performance. As of June 2010, three supercomputers have achieved petaflops speed: Cray Jaguar (224,162 processors, 1.759 petaflops), Dawning Nebulae (120,640 processors, 1.271 petaflops), and IBM Roadrunner (122,400 processors, 1.042 petaflops) (1). According to Moore’s law of computing hardware, the following quantities increase (decrease) exponentially, doubling (halving) approximately every 2 years: the number of transistors per integrated circuit (cost per transistor), processing speed, memory/storage capacity (cost per unit of information), and network capacity (2). While performance/cost has increased dramatically, power consumption in computer systems has also increased according to Moore’s law. To achieve higher computing performance per processor, microprocessor manufacturers have doubled the power density at an exponential speed over decades, which will soon reach that of a nuclear reactor (3). Such increased energy consumption causes severe economic, ecological, and technical problems.
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملA Lower Bound for Power-Aware Task Scheduling on Multiprocessor Computers
We address task scheduling on multiprocessor computers with dynamically variable voltage and speed as a combinatorial optimization problem. We define the problem of minimizing schedule length with energy consumption constraint on multiprocessor computers. We derive a lower bound for the optimal schedule length for the problem of minimizing schedule length with energy consumption constraint.
متن کاملEnergy Efficient Task Allocation and Scheduling in Distributed Homogeneous Multiprocessor Systems
With the advent of semi conductor technology, the development of more complex embedded real time applications is made possible today. This accelerates the development and support for multiprocessor based systems. The paper presents the development of “a power-aware real time embedded system for temperature monitoring and control in safety critical applications”. The main objective of the work i...
متن کامل